Languages and compatible relations on monoids ∗
نویسنده
چکیده
With every monoid, one can associate various binary relations, in particular the so-called principal quasi-order, principal order and principal congruence. The aim of this paper is to show that any compatible quasiorder, order and congruence can be obtained as an intersection of the corresponding principal relations. The particular case of languages -subsets of free monoids generated by an alphabetis also considered.
منابع مشابه
Ordered Monoids: Languages and Relations
We give a finite axiomatization for the variety generated by relational, integral ordered monoids. As a corollary we get a finite axiomatization for the language interpretation as well.
متن کاملOn Recognizable Languages in Left Divisibility Monoids
We describe a class of monoids where c-rational languages can be deened analogously to trace theory and where these languages are precisely the recognizable ones. The proofs rely on Ramsey's theorem, distributive lattice theory and on Hashigushi's rank function generalized to our left divisibility monoids. We obtain Ochma nski's theorem on recognizable languages in free partially commutative mo...
متن کاملOn Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directions, including trace and rational monoids. Here, we investigate divisibility monoids which are defined by and capture algebraic properties sufficient to obtain a characterization of the recognizable languages by certain...
متن کاملOn Varieties of Ordered Automata
The classical Eilenberg correspondence, based on the concept of the syntactic monoid, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence appeared, with more general classes of regular languages on one hand and classes of more complex algebraic structures on the other hand. For example, classes of languages need not be clos...
متن کاملLanguages and monoids with disjunctive identity.dvi
We show that the syntactic monoids of insertion-closed, deletionclosed and dipolar-closed languages are the groups. If the languages are insertionclosed and congruence simple, then their syntactic monoids are the monoids with disjunctive identity. We conclude with some properties of dipolarclosed languages.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010